System and method for content validation

ABSTRACT

A method includes receiving at a directory server a notification from a client system, where the notification indicates that the first client received a corrupt packet of a playfile from a first peer. The method also includes determining if the first peer is a poor quality peer, updating a first peer score for the first peer if the first peer is not a poor quality peer, identifying a second peer that is not on a blacklist, and providing a peer identification associated with the second peer to the client system.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.13/333,514 filed on Dec. 21, 2011, which is a continuation of U.S.patent application Ser. No. 12/332,008 filed on Dec. 10, 2008, now U.S.Pat. No. 8,108,544, the disclosures of which are hereby incorporated byreference in their entireties.

FIELD OF THE DISCLOSURE

The present disclosure generally relates to Internet Protocol Television(IPTV) networks, and more particularly relates to a system and methodfor content validation.

BACKGROUND

Video-on-demand (VOD) service allows a television viewer to see aprogram at a time of their choosing. This stands in contrast totraditional broadcast television service that requires a viewer toselect from a list of programs that are shown at a predetermined time.Such time-shifting is one advantage that VOD service offers viewers overtraditional television service.

BRIEF DESCRIPTION OF THE DRAWINGS

It will be appreciated that for simplicity and clarity of illustration,elements illustrated in the Figures have not necessarily been drawn toscale. For example, the dimensions of some of the elements areexaggerated relative to other elements. Embodiments incorporatingteachings of the present disclosure are shown and described with respectto the drawings presented herein, in which:

FIGS. 1, 2, and 3 are block diagrams illustrating an embodiment of anInternet Protocol Television (IPTV) network;

FIG. 4 is a block diagram illustrating an exemplary data model;

FIG. 5 is a flow diagram illustrating an exemplary method forpeer-to-peer distribution of content;

FIG. 6 is a flow diagram illustrating an exemplary method of verifyingcontent received from a peer;

FIG. 7 is a flow diagram illustrating another exemplary method ofverifying content received from a peer;

FIG. 8 is a flow diagram illustrating an exemplary method providinginformation to verify content received from a peer;

FIG. 9 is a flow diagram illustrating an exemplary method of trackingpeers providing invalid content;

FIG. 10 is a block diagram illustrating an IPTV network in accordancewith one embodiment of the present disclosure; and

FIG. 11 is an illustrative embodiment of a general computer system.

The use of the same reference symbols in different drawings indicatessimilar or identical items.

DETAILED DESCRIPTION OF THE DRAWINGS

The numerous innovative teachings of the present application will bedescribed with particular reference to the presently preferred exemplaryembodiments. However, it should be understood that this class ofembodiments provides only a few examples of the many advantageous usesof the innovative teachings herein. In general, statements made in thespecification of the present application do not necessarily limit any ofthe various claimed inventions. Moreover, some statements may apply tosome inventive features but not to others.

FIG. 1 shows one example embodiment of a television distribution systemor network 100, using IPTV technology in this example but not limitedthereto, adapted to provide, among other things, the VOD features of thedisclosed subject matter. The network 100 may include a super hub office(SHO) 110 for acquisition and encoding of video content, one or morevideo hub offices (VHO) 120 in each demographic market area (DMA), oneor more intermediate offices (IO) 130, one or more central offices (CO)140 located in each metropolitan area, and customer premises equipment(CPE) 150 that may be located in single or multiple dwelling units. Inone example embodiment, the network 100 may be connected through aplurality of high-speed communication links 160 using physical transportlayers such as fiber, cable, twisted pair, air, or other media.

In one example embodiment of the IPTV video delivery system, the SHO 110distributes content to one or more VHOs 120 which may be spread across awide geographic territory, such as an entire country. The SHO 110 may,for example, be in a central location for acquisition and aggregation ofnational-level broadcast television (or linear) programming A redundantSHO 110 may be provided for backup in case of failure. The SHO 110 mayalso provide the central point of on-demand content acquisition andinsertion into the IPTV network. Linear programming may be received atthe SHO 110 via satellite and processed for delivery to the VHO 120.Linear programming may also be converted and stored for use as VODcontent. Additional VOD content may be received from various sources andprocessed/encoded to codec and bit rate requirements of thecommunication network for transmission to the VHO 120 over the highspeed communication links. The VHOs 120 are the video distributionpoints within each DMA or geographic region.

FIG. 2 shows an example network architecture 200 between the CO 140 andthe viewer. A serving area interface (SAI) 210 may be connected to theCO 140. SAI 210 may, for example, be located in a weather-proofenclosure proximate to the viewer premises, and may includefiber-to-the-node (FTTN) equipment. FTTN equipment may also be locatedin the CO 140. CPE 150 includes, for example, a network interface device(NID) and a residential gateway (RG) 230, with a built-in very-high-bitrate digital subscriber loop (VDSL) modem or optical network termination(ONT). In either case, the RG 230 may be connected to the rest of thehome set-top boxes (STBs) 240 via an internal network such as anEthernet. Each STB 240 has an associated remote control (RC) 250 thatprovides data entry to the STB 240 to control the IPTV selections fromthe IPTV data streams.

FIG. 3 shows one example embodiment of an SHO acquisition server 310that may be used to acquire national content to be distributed towardsthe VHO 120. In an alternative embodiment, live television content maybe acquired using an acquisition server 320 in the VHO 120. In thisconfiguration, the VHO 120 may include the live television acquisitionserver 320 and a video distribution server 330, which forward the livetelevision and/or other content toward the CPE 150 through theintermediate offices (IOs) 130 and the central office (CO) 140. A VHO120 may also include application server 340 and regional viewer databasesystems 350. Traffic may reach the CPE 150 at least partially via eitherFTTN or fiber to the premises (FTTP), or by other types of transmissionmedium.

The acquisition server 320 may distribute a plurality of live televisionprograms, each typically associated with a television “channel,” using amulticast IP protocol data stream 370 through the IOs 130 and COs 140 tothe CPE 150. The routers, switches, and other network elements thatwould normally be present in the IOs 130 and COs 140 are not shown inFIG. 3 in order to simplify the drawing. The number of programs orchannels sent in the multicast stream may range up to seven hundredchannels or more using present technology, with it being understood thatadvances in technology may allow many more channels to be sent. Themulticast protocol allows for efficient distribution of these signals toa large number of CPE 150. In addition, the video distribution server330 receives the multicast data stream 370, and distributes selectedones of the live television signals, extracted from the stream 370,using a unicast data stream 380 a, 380 b, or 380 c, to specific CPE 150.

Also provided in the VHO 120, or alternatively at another distributionpoint in the IPTV network such as the SHO 110, IO 130, or CO 140, is aVOD server 390 that distributes content to CPE 150. VHO 120 may beconnected to, in an example embodiment, one or more mass storage devicesor systems 327, such as magnetic disk drives or optical recordingsystems. In addition, VOD server 390 includes software to supportinteraction with CPE 150 through STB 240. For example, viewers caninteract with the VOD server 390 using the remote control 250 and an STB240 to request delivery of the content to them from VOD server 390. TheSTB 240 may request content on VOD server 390 that is delivered, in oneexample embodiment, with multicast data stream 375. Alternatively, thecontent may be delivered with a unicast data stream from the VOD server390 to the STB 240.

According to one embodiment, access to programming under the control ofVOD server 390, or alternatively access to regularly scheduledprogramming on the television channels, may be controlled by an STB 240in the viewer's premises. Thus, in one example embodiment, the VODserver 390 provides television programming upon demand by viewers asmore fully described herein.

According to one example embodiment, referring to FIGS. 2 and 3,television shows may be monitored on the viewer side, for example in theSTB 240. On the viewer side, the STB 240 can receive viewer-initiatedcontrol commands, such as channel changes, video-on-demand programordering, and other control information from, for example the RC 250.This information can be used to collect accurate information of all theviewers' television viewing information by querying each individualviewer's STB 240. Alternatively, if such statistics are not availablefrom the STB 240, viewing information can be obtained from the RG 230based on IP multicast information obtained from the RG. In anotherembodiment, the viewing information may be obtained from the VHO 120based on, for example, VOD requests sent from the STB 240 to the VODserver 390 in VHO 120. As a result, viewing information can be collectedfrom the VOD server 390 and used to determine the overall viewing of aparticular show, such as for billing or determining popularity of thecontent.

In an embodiment, VOD servers can be located throughout a communicationsnetwork, such as the Internet or a cellular data network. The VODservers can provide VOD content to devices within the communicationsnetwork including cell phones, computers, or other devices capable ofreceiving and displaying VOD content. A device can receive the VODcontent from a VOD server closest to the device within the network.

FIG. 4 shows an exemplary data model, generally designated 400. Content402 and 404 such as video programming, data files, software, or otherdigital information, can consist of a sequence of segments 406-410. Asegment 410 can be part of multiple content 402 and 404. For example, asegment including the opening or closing sequences for a televisionseries can be included in multiple episodes. Segments 406-410 can becomprised of a sequence of chunks 412-428. The size of the chunks412-428 may be chosen based on several considerations, including typicalfile size, amortization of overhead, and resilience to download failuresfrom a serving node. Each chunk 412-428, segment 406-410, and content402 and 404 can be assigned a globally unique identifier (GUID).Additionally, a chunk 418 may be incorporated into multiple segments 406and 408 and have multiple GUIDs.

In an exemplary embodiment, a playfile can be provided for each content.The playfile can include the information about the segments and chunksthat are part of the content. For example, the playfile may include alist of segment and chunk identifiers in an order required toreconstruct or playback the content. The chunk identifiers may include ahash of the entire chunk. Similarly, the segment identifiers may includea hash of the entire segment. The hash can be computed using the MD5algorithm, the SHA-1 algorithm, or other cryptographically secure hashalgorithms known in the art. Alternatively, the playfile may include acontent record including segment identifiers and the order of thesegments. The playfile may further include a segment record for eachsegment identified in the content record. Each segment record mayinclude chunk identifiers and the order of the chunks within eachsegment. A receiver, such as STB 240, can use the playfile to determinewhich chunks are needed to reconstruct or playback the content. Further,the playfile can include hashes of a number of packets for each chunk.The packets can be blocks of data of a predefined size. In an exemplaryembodiment, a server may generate a unique playfile for each receiverrequesting content. The unique playfile may include securityinformation, such as hashes for verification of packets or chunks withinthe content. The unique playfile may be distributed securely, such asvia an encrypted connection, to the receiver.

FIG. 5 shows a flow diagram illustrating an exemplary embodiment ofpeer-to-peer distribution of content. At 502, a receiver, such as STB240, can receive a playfile for the content. The playfile can identifythe segments and chunks that comprise the content. Additionally, theplayfile can indicate an order of the chunks required for reconstructionor playback of the content. In an embodiment, the playfile may betransmitted securely, such as over an encrypted connection. At 504, thereceiver can request a chunk identified in the playfile for the content.At 506, the receiver can check the local cache for the chunk. When thechunk is available from the local cache, the receiver can retrieve thechunk from the local cache and may return to 504 to request anadditional chunk.

At 508, when the chunk is unavailable from the local cache, the receivercan determine if the chunk is available from a server, such as through amulticast or unicast stream. The chunk may be immediately available, orthe chunk may be scheduled for delivery at a later time. Additionally,the receiver can provide the server with a deadline for receiving thechunk. In an embodiment, the chunk can be available through a multicaststream and scheduled for delivery within the deadline requested by thereceiver. When the chunk is available through a multicast stream, thereceiver can join the multicast stream at 510 and receive the chunk andreturn to 504 to request an additional chunk. In an embodiment, thereceiver can continue to receive subsequent chunks from the server.

When the chunk is not available from the server, the receiver can find apeer storing the chunk, as illustrated at 512. In an embodiment, thepeers may be peers that are close in the network to the receiver.Additionally, peer servers may be located throughout the network tocache content close to the receivers. The receiver may send a request toa server to identify which peers are storing the chunk. Alternatively,the receiver may send a request to a set of peers to determine whichpeers are storing the chunk. The request may be a broadcast request toall peers, or it may be directed requests to known peers. Known peersmay include peers that have previously requested or served content. Whenno peer currently storing the chunk is located, the receiver can receivethe chunk from the server at 510 and return to 504 to request anadditional chunk. At 512, when a peer storing the chunk is found, thereceiver can receive the chunk from the peer, as illustrated at 514, andmay return to 504 to request an additional chunk.

In an exemplary embodiment, requests for additional chunks may bestreamlined. For example, if a peer is found to provide a first chunk,the receiver may retrieve additional available sequential chunks fromthe peer without searching for an alternative peer. Alternatively, if nopeer is found with a first chunk or if the first chunk is providedthrough a multicast stream, the receiver may retrieve several sequentialchunks from the server without searching for a peer with thosesequential chunks.

In another exemplary embodiment, the receiver may receive chunks frommore than one peer. For example, the receiver can receive a first chunkfrom a first peer while receiving a second chunk from a second peer.Utilizing multiple sources for the chunks can decrease the time requiredto receive multiple chunks when the available upload bandwidth of a peeris less than the available download bandwidth of the receiver.

FIG. 6 shows a flow diagram illustrating an exemplary method forvalidating content. As illustrated at 602, a receiver, such as STB 240,can receive a playfile from a server, such as VOD server 390. Theplayfile can include an ordered list of chunks for the content. Thecontent may be VOD content, a data file, a software update, or otherdigital information. Additionally, the playfile can include hashes of atleast a portion of the chunks. In an embodiment, the hash of the chunkmay be included in a chunk identifier. At 604, the receiver can receivea chunk. The chunk may be received from a trusted source, such as theVOD server, or a non-trusted source, such as a peer. When the content isreceived from a trusted source, the receiver may not need to validatethe chunk. Alternatively, when the content is received from anon-trusted source, the receiver may validate the chunk based on thehash information included in the playfile.

At 606, when the chunk was received from a trusted source, the receivercan utilize the chunk, as illustrated at 608. Alternatively, when thechunk is not received from the trusted source, such as when the chunk isreceived from a peer, the receiver may calculate the hash of the chunk,as illustrated at 610. At 612, the receiver can compare the calculatedhash of the chunk to the corresponding hash included in the playfile.When the calculated hash matches the corresponding hash included in theplayfile, the receiver can utilize the chunk. For example, when thechunk is a part of VOD content, the chunk may be displayed. In anotherexample, when the chunk is part of a data file, the chunk may be saveduntil the remaining chunks have been received. Alternatively, when thecalculated hash does not match the corresponding hash included in theplayfile, the chunk may be corrupted. For example, a network error mayhave occurred or the chunk may have been tampered with. At 614, thereceiver can identify a new source for the chunk, and download the chunkfrom the new source at 604.

FIG. 7 shows a flow diagram illustrating another exemplary method forvalidating content. As illustrated at 702, a receiver, such as STB 240,can receive a playfile from a server, such as VOD server 390. Theplayfile can include an order list of chunks for the content. Thecontent may be VOD content, a data file, a software update, or otherdigital information. Additionally, the playfile can include packetidentifiers and hashes for at least a subset of the packets that make upthe chunks. The packet identifiers can be the sequence number of thepacket within the chunk. In an embodiment, the playfile can be unique tothe client. For example, the subset of packets may be randomly selectedto be unique to the client.

At 704, the receiver can request a chunk. The receiver may request thechunk from a trusted source, such as the server, or a non-trustedsource, such as a peer. When the chunk is received from a trustedsource, the receiver may not validate the content. Alternatively, whenthe chunk is received from a non-trusted source, the receiver mayvalidate the content based on the hash information included in theplayfile.

At 706, when the chunk is requested from a trusted source, the receivercan receive the packets of the chunk, as illustrated at 708. At 710, thereceiver can utilize the chunk. For example, when the chunk is a part ofVOD content, the chunk may be displayed. Further, when the content is arealtime audio/video stream, the packets may be played as receivedwithout waiting to receive the complete chunk. In another example, suchwhen the chunk is part of a data file, the chunk may be saved until theremaining chunks have been received.

Alternatively, when the chuck is requested from a non-trusted source,such as a peer, the receiver can receive a packet of the chunk, asillustrated at 712. At 714, the receiver can determine if the packetrequires validation. The packet can require validation when the playfileincludes a packet identifier and hash corresponding to the packet. Whenthe packet does not require validation, the receiver can determine ifthe packet is the final packet of the chunk, as illustrated at 716. Whenthe packet is the final packet of the chunk, the receiver can utilizethe chunk, as illustrated at 710. In an embodiment, when the content isa realtime audio/video stream, the packets may be played as receivedwithout waiting to receive the complete chunk. Alternatively, when thepacket is not the final packet, the receiver can receive another packetof the chunk, as illustrated at 712.

Returning to 714, when the packet requires validation, the receiver cancalculate a hash of the packet, as illustrated at 718. At 720, thereceiver can compare the calculated hash to the corresponding hashincluded in the playfile. When the calculated hash matches thecorresponding hash, the packet is valid and the receiver can determineif the packet is the final packet of the chunk, as illustrated at 716.

Alternatively, when the calculated hash does not match the correspondinghash, the chunk may be corrupted. For example, a network error may haveoccurred or the peer may have altered the chunk. At 722, the receivercan identify a new source for the chunk, and request the chunk from thenew source at 704. In an embodiment, the receiver may track the numberof corrupted packets and discard the chunk only after the number ofcorrupted packets exceeds a threshold or a percentage of the totalpackets. Additionally, the receiver may report the identity of the peerand the number of corrupted packets to a server, such as a directoryserver. The directory server may use a peer score to determine thequality of the peer. The peer score can incorporate information such asthe number of corrupt packets received from the peer, the number ofclients reporting they have received corrupt packets from the peer, theratio of corrupt packets to good packets received from the peer, or thelike. When the peer score exceeds a threshold, the peer may bedetermined to be of poor quality and may be blacklisted. A poor qualityor blacklisted peer may no longer be used to provide content.

FIG. 8 shows a flow diagram illustrating an exemplary method forproviding the playfile. At 802 a server, such as VOD server 390, canreceive a request for a playfile from a receiver. The request for theplayfile can include information identifying the content, such as acontent identifier. At 804, the server can determine a set ofverification packets. The set of verification packets can be a subset ofthe packets required for the content. Additionally, the set ofverification packets can be unique to the receiver. In an embodiment,the verification packets for a chunk can be randomly selected anddistributed substantially equally throughout the content. For example, asimilar number of verification packets can be selected for each chunk.Additionally, packet selection may be unrestricted or limited to packetscontaining certain information, such as only packets including at leasta portion of an MPEG I-frame.

In an embodiment, the number of verification packets per chunk candepend on a verification policy. The verification policy may mandatethat certain types of high-priority content require more verificationpackets. High priority content may include pay-per-view content, newsprograms, software updates, and the like. Additionally, the verificationpolicy may require a greater number of verification packets for specifictypes of viewers or types of receivers. Further, the resolution of thecontent or playback device, video bitrates, perceived number ofmalicious peers, and the rate of network errors may influence the numberof verification packets per chunk.

At 806, the server can generate a playfile specific to the receiver. Theplayfile can include the sequence of chunks required for the content andthe identity and hash of each verification packet. At 808, the servercan provide the playfile to the receiver.

In an embodiment, the server may calculate the hash for each packet ofthe content when the content is initially received from the contentprovider. The hash for each packet may be stored along with metadata ofthe content. In this way, the server only needs to calculate the hash ofeach packet once, and can retrieve the hash relatively quickly when theplayfile is requested.

FIG. 9 shows a flow diagram illustrating an exemplary method fortracking peers providing invalid packets. At 902, a server, such as adirectory server, can receive a bad packet notification from a client.The bad packet notification can identify a peer from which the clientreceived a corrupt or invalid packet. The hash calculated for thecorrupt or invalid packet may not match the corresponding hash includedin the playfile. At 904, the server can determine if the peer is a poorquality peer. The poor quality peer may be a peer that intentionallyprovides corrupt packets or may be a peer with a poor quality networkconnection that results in a higher that expected network error rate.The server may determine the peer is a poor quality peer based on a peerscore. The peer score can represent a number of bad packet received, anumber of clients reporting bad packets, or any combination thereof. Apoor quality peer can have a peer score that exceeds a threshold. In anembodiment, the threshold can depend on the expected error rate of thenetwork to avoid classifying an excessive number of peers as poorquality peers due to network errors. At 906, when the server determinesthe peer is a poor quality peer, the server can add the peer to ablacklist. Alternatively, when the server does not determine that thepeer is a poor quality peer, the server can update the peer score, asillustrated at 908.

At 910, the server can receive a request for a peer identifier from aclient. The client may request the peer identifier in order to identifya quality peer that has a packet needed by the client. At 912, theserver can identify a peer that has the packet and is not on theblacklist. For example, the peer can have a peer score that is below thethreshold. At 914, the server can provide the peer identifier to theclient.

FIG. 10 shows an IPTV system 1000 that can be used in conjunction withtelevision distribution system or network 100. IPTV system 1000 caninclude a client facing tier 1002, an application tier 1004, anacquisition tier 1006, and an operations and management tier 1008. Eachtier 1002, 1004, 1006, and 1008 is coupled to one or both of a privatenetwork 1010 and a public network 1012. For example, the client-facingtier 1002 can be coupled to the private network 1010, while theapplication tier 1004 can be coupled to the private network 1010 and tothe public network 1012 such as the Internet. The acquisition tier 1006can also be coupled to the private network 1010 and to the publicnetwork 1012. Moreover, the operations and management tier 1008 can becoupled to the public network 1012.

The various tiers 1002, 1004, 1006, and 1008 communicate with each othervia the private network 1010 and the public network 1012. For instance,the client-facing tier 1002 can communicate with the application tier1004 and the acquisition tier 1006 via the private network 1010. Theapplication tier 1004 can also communicate with the acquisition tier1006 via the private network 1010. Further, the application tier 1004can communicate with the acquisition tier 1006 and the operations andmanagement tier 1008 via the public network 1012. Moreover, theacquisition tier 1006 can communicate with the operations and managementtier 1008 via the public network 1012. In a particular embodiment,elements of the application tier 1004 can communicate directly with theclient-facing tier 1002.

The client-facing tier 1002 can communicate with user equipment via aprivate access network 1066, such as an IPTV network. In an illustrativeembodiment, modems such as a first modem 1014 and a second modem 1022can be coupled to the private access network 1066. The client-facingtier 1002 can communicate with a first representative set-top box (STB)device 1016 via the first modem 1014 and with a second representativeset-top box device 1024 via the second modem 1022. The client-facingtier 1002 can communicate with a large number of set-top boxes over awide geographic area, such as a regional area, a metropolitan area, aviewing area, or any other suitable geographic area that can besupported by networking the client-facing tier 1002 to numerous set-topbox devices. In one embodiment, the client-facing tier 1002 can becoupled to the modems 1014 and 1022 via fiber optic cables.Alternatively, the modems 1014 and 1022 can be digital subscriber line(DSL) modems that are coupled to one or more network nodes via twistedpairs, and the client-facing tier 1002 can be coupled to the networknodes via fiber-optic cables. Each set-top box device 1016 and 1024 canprocess data received from the private access network 1066 via an IPTVsoftware platform such as Microsoft® TV IPTV Edition.

The first set-top box device 1016 can be coupled to a first displaydevice 1018, such as a first television monitor, and the second set-topbox device 1024 can be coupled to a second display device 1026, such asa second television monitor. Moreover, the first set-top box device 1016can communicate with a first remote control 1020, and the second set-topbox device can communicate with a second remote control 1028. In anexemplary, non-limiting embodiment, each set-top box device 1016 and1024 can receive data or video from the client-facing tier 1002 via theprivate access network 1066 and render or display the data or video atthe display device 1018 or 1026 to which it is coupled. The set-top boxdevices 1016 and 1024 thus may include tuners that receive and decodetelevision programming information for transmission to the displaydevices 1018 and 1026. Further, the set-top box devices 1016 and 1024can include an STB processor 1070 and an STB memory device 1072 that isaccessible to the STB processor. In a particular embodiment, the set-topbox devices 1016 and 1024 can also communicate commands received fromthe remote controls 1020 and 1028 back to the client-facing tier 1002via the private access network 1066.

In an illustrative embodiment, the client-facing tier 1002 can include aclient-facing tier (CFT) switch 1030 that manages communication betweenthe client-facing tier 1002 and the private access network 1066 andbetween the client-facing tier 1002 and the private network 1010. Asshown, the CFT switch 1030 is coupled to one or more data servers 1032that store data transmitted in response to user requests, such asvideo-on-demand material. The CFT switch 1030 can also be coupled to aterminal server 1034 that provides terminal devices, such as a gameapplication server and other devices with a common connection point tothe private network 1010. In a particular embodiment, the CFT switch1030 can also be coupled to a VOD server 1036.

The application tier 1004 can communicate with both the private network1010 and the public network 1012. In this embodiment, the applicationtier 1004 can include a first application tier (APP) switch 1038 and asecond APP switch 1040. In a particular embodiment, the first APP switch1038 can be coupled to the second APP switch 1040. The first APP switch1038 can be coupled to an application server 1042 and to an OSS/BSSgateway 1044. The application server 1042 provides applications to theset-top box devices 1016 and 1024 via the private access network 1066,so the set-top box devices 1016 and 1024 can provide functions such asdisplay, messaging, processing of IPTV data and VOD material. In aparticular embodiment, the OSS/BSS gateway 1044 includes operationsystems and support (OSS) data, as well as billing systems and support(BSS) data.

The second APP switch 1040 can be coupled to a domain controller 1046that provides web access, for example, to users via the public network1012. The second APP switch 1040 can be coupled to a subscriber andsystem store 1048 that includes account information, such as accountinformation that is associated with users who access the system 1000 viathe private network 1010 or the public network 1012. In a particularembodiment, the application tier 1004 can also include a client gateway1050 that communicates data directly to the client-facing tier 1002. Inthis embodiment, the client gateway 1050 can be coupled directly to theCFT switch 1030. The client gateway 1050 can provide user access to theprivate network 1010 and the tiers coupled thereto.

For example, when the set-top box device 1016 accesses the system 1000via the private access network 1066, the client gateway 1050 can verifyviewer information by communicating with the subscriber and system store1048 via the private network 1010, the first APP switch 1038 and thesecond APP switch 1040. Further, the client gateway 1050 can verifybilling information and status by communicating with the OSS/BSS gateway1044 via the private network 1010 and the first APP switch 1038. TheOSS/BSS gateway 1044 can transmit a query across the first APP switch1038, to the second APP switch 1040, and the second APP switch 1040 cancommunicate the query across the public network 1012 to the OSS/BSSserver 1064. After the client gateway 1050 confirms viewer and/orbilling information, the client gateway 1050 can allow the set-top boxdevice 1016 access to IPTV content and VOD content. If the clientgateway 1050 cannot verify viewer information for the set-top box device1016, such as because it is connected to a different twisted pair, theclient gateway 1050 can deny transmissions to and from the set-top boxdevice 1016 beyond the private access network 1066.

The acquisition tier 1006 includes an acquisition tier (AQT) switch 1052that communicates with the private network 1010. The AQT switch 1052 canalso communicate with the operations and management tier 1008 via thepublic network 1012. In a particular embodiment, the AQT switch 1052 canbe coupled to a live acquisition server 1054 that receives televisioncontent, for example, from a broadcast service 1056. Further, the AQTswitch can be coupled to a VOD importer server 1058 that storestelevision content received at the acquisition tier 1006 and communicatethe stored content to the client-facing tier 1002, such as to VOD server1036, via the private network 1010.

The operations and management tier 1008 can include an operations andmanagement tier (OMT) switch 1060 that conducts communication betweenthe operations and management tier 1008 and the public network 1012. Inthe illustrated embodiment, the OMT switch 1060 is coupled to a TV2server 1062. Additionally, the OMT switch 1060 can be coupled to anOSS/BSS server 1064 and to a simple network management protocol (SNMP)monitor 1067 that monitors network devices. In a particular embodiment,the OMT switch 1060 can communicate with the AQT switch 1052 via thepublic network 1012.

In a particular embodiment during operation of the IPTV system, the liveacquisition server 1054 can acquire television content from thebroadcast service 1056. The live acquisition server 1054 in turn cantransmit the television content to the AQT switch 1052 and the AQTswitch can transmit the television content to the CFT switch 1030 viathe private network 1010. Further, the television content can be encodedat the D-servers 1032, and the CFT switch 1030 can communicate thetelevision content to the modems 1014 and 1022 via the private accessnetwork 1066. Additionally, the VOD server 1036 may capture and storethe television content for later use, such as video-on-demand. Theset-top box devices 1016 and 1024 can receive the television contentfrom the modems 1014 and 1022, decode the television content, andtransmit the content to the display devices 1018 and 1026 according tocommands from the remote control devices 1020 and 1028.

Additionally, at the acquisition tier 1006, the VOD importer server 1058can receive content from one or more VOD sources outside the IPTV system1000, such as movie studios and programmers of non-live content. The VODimporter server 1058 can transmit the VOD content to the AQT switch1052, and the AQT switch 1052 in turn can communicate the material tothe CFT switch 1030 via the private network 1010. The VOD content can bestored at one or more servers, such as the VOD server 1036.

When a user issues a request for VOD content to the set-top box device1016 or 1024, the request can be transmitted over the private accessnetwork 1066 to the VOD server 1036 via the CFT switch 1030. Uponreceiving such a request, the VOD server 1036 can retrieve requested VODcontent and transmit the content to the set-top box device 1016 or 1024across the private access network 1066 via the CFT switch 1030.

The domain controller 1046 communicates with the public network 1012 viathe second APP switch 1040. Additionally, the domain controller 1046 cancommunicate via the public network 1012 with the PC 1068. For example,the domain controller 1046 can display a web portal via the publicnetwork 1012 and allow users to access the web portal using the PC 1068.Further, in an illustrative embodiment, the domain controller 1046 cancommunicate with at least one wireless network access point 1078 over adata network 1076. In this embodiment, each wireless network accessdevice 1078 can communicate with user wireless devices such as acellular telephone 1084.

In a particular embodiment, the set-top box devices can include an STBcomputer program 1074 that is embedded within the STB memory device1072. The STB computer program 1074 can contain instructions to receiveand execute at least one user television viewing preference that a userhas entered by accessing an Internet user account via the domaincontroller 1046. For example, the user can use the PC 1068 to access aweb portal maintained by the domain controller 1046 via the Internet.The domain controller 1046 can query the subscriber and system store1048 via the private network 1010 for account information associatedwith the user. In a particular embodiment, the account information canassociate the user's Internet account with the second set-top box device1024. For instance, in an illustrative embodiment, the accountinformation can relate the user's account to the second set-top boxdevice 1024 by associating the user account with an IP address of thesecond set-top box device, with data relating to one or more twistedpairs connected with the second set-top box device, with data related toone or more fiber optic cables connected with the second set-top boxdevice, with an alphanumeric identifier of the second set-top boxdevice, with any other data that is suitable for associating the secondset-top box device with a user account, or with any combination ofthese.

The STB computer program 1074 can contain instructions to receive manytypes of user preferences from the domain controller 1046 via the accessnetwork 1066. For example, the STB computer program 1074 can includeinstructions to receive a request to record at least one televisionprogram at a video content storage module such as a digital videorecorder (DVR) 1082 within the second set-top box device 1024. In thisexample embodiment, the STB computer program 1074 can includeinstructions to transmit the request to the DVR 1082, where thetelevision program(s) are recorded. In an illustrative embodiment, theSTB computer program 1074 can include instructions to receive from theDVR 1082 a recording status with respect to one or more of thetelevision programs and to transmit at least one message regarding thestatus to a wireless device, such as the cellular telephone 1084. Themessage can be received at the CFT switch 1030, for instance, andcommunicated to the domain controller 1046 across the private network1010 via the second APP switch 1040. Further, the domain controller 1046can transmit the message to the wireless data network 1076, directly orvia the public network 1012, and on to the wireless network access point1078. The message can then be transmitted to the cellular telephone1084. In an illustrative embodiment, the status can be sent via awireless access protocol (WAP).

FIG. 11 shows an illustrative embodiment of a general computer system1100. The computer system 1100 can include a set of instructions thatcan be executed to cause the computer system to perform any one or moreof the methods or computer based functions disclosed herein. Thecomputer system 1100 may operate as a standalone device or may beconnected, such as by using a network, to other computer systems orperipheral devices.

In a networked deployment, the computer system may operate in thecapacity of a server or as a client user computer in a server-clientuser network environment, or as a peer computer system in a peer-to-peer(or distributed) network environment. The computer system 1100 can alsobe implemented as or incorporated into various devices, such as apersonal computer (PC), a tablet PC, an STB, a personal digitalassistant (PDA), a mobile device, a palmtop computer, a laptop computer,a desktop computer, a communications device, a wireless telephone, aland-line telephone, a control system, a camera, a scanner, a facsimilemachine, a printer, a pager, a personal trusted device, a web appliance,a network router, switch or bridge, or any other machine capable ofexecuting a set of instructions (sequential or otherwise) that specifyactions to be taken by that machine. In a particular embodiment, thecomputer system 1100 can be implemented using electronic devices thatprovide voice, video or data communication. Further, while a singlecomputer system 1100 is illustrated, the term “system” shall also betaken to include any collection of systems or sub-systems thatindividually or jointly execute a set, or multiple sets, of instructionsto perform one or more computer functions.

The computer system 1100 may include a processor 1102, such as a centralprocessing unit (CPU), a graphics processing unit (GPU), or both.Moreover, the computer system 1100 can include a main memory 1104 and astatic memory 1106 that can communicate with each other via a bus 1108.As shown, the computer system 1100 may further include a video displayunit 1110 such as a liquid crystal display (LCD), an organic lightemitting diode (OLED), a flat panel display, a solid-state display, or acathode ray tube (CRT). Additionally, the computer system 1100 mayinclude an input device 1112 such as a keyboard, and a cursor controldevice 1114 such as a mouse. Alternatively, input device 1112 and cursorcontrol device 1114 can be combined in a touchpad or touch sensitivescreen. The computer system 1100 can also include a disk drive unit1116, a signal generation device 1118 such as a speaker or remotecontrol, and a network interface device 1120 to communicate with anetwork 1126. In a particular embodiment, the disk drive unit 1116 mayinclude a computer-readable medium 1122 in which one or more sets ofinstructions 1124, such as software, can be embedded. Further, theinstructions 1124 may embody one or more of the methods or logic asdescribed herein. In a particular embodiment, the instructions 1124 mayreside completely, or at least partially, within the main memory 1104,the static memory 1106, and/or within the processor 1102 duringexecution by the computer system 1100. The main memory 1104 and theprocessor 1102 also may include computer-readable media.

The illustrations of the embodiments described herein are intended toprovide a general understanding of the structure of the variousembodiments. The illustrations are not intended to serve as a completedescription of all of the elements and features of apparatus and systemsthat utilize the structures or methods described herein. Many otherembodiments may be apparent to those of skill in the art upon reviewingthe disclosure. Other embodiments may be utilized and derived from thedisclosure, such that structural and logical substitutions and changesmay be made without departing from the scope of the disclosure.Additionally, the illustrations are merely representational and may notbe drawn to scale. Certain proportions within the illustrations may beexaggerated, while other proportions may be minimized. Accordingly, thedisclosure and the FIGs. are to be regarded as illustrative rather thanrestrictive.

The Abstract of the Disclosure is provided to comply with 37 C.F.R.§1.72(b) and is submitted with the understanding that it will not beused to interpret or limit the scope or meaning of the claims. Inaddition, in the foregoing Detailed Description of the Drawings, variousfeatures may be grouped together or described in a single embodiment forthe purpose of streamlining the disclosure. This disclosure is not to beinterpreted as reflecting an intention that the claimed embodimentsrequire more features than are expressly recited in each claim. Rather,as the following claims reflect, inventive subject matter may bedirected to less than all of the features of any of the disclosedembodiments. Thus, the following claims are incorporated into theDetailed Description of the Drawings, with each claim standing on itsown as defining separately claimed subject matter.

The above disclosed subject matter is to be considered illustrative, andnot restrictive, and the appended claims are intended to cover all suchmodifications, enhancements, and other embodiments which fall within thetrue spirit and scope of the present disclosed subject matter. Thus, tothe maximum extent allowed by law, the scope of the present disclosedsubject matter is to be determined by the broadest permissibleinterpretation of the following claims and their equivalents, and shallnot be restricted or limited by the foregoing detailed description.

What is claimed is:
 1. A system, comprising: a memory that storesinstructions; a processor that executes the instructions to performoperations, the operations comprising: receiving a playfile associatedwith content, wherein the playfile includes a first hash of a portion ofa chunk of the content; receiving the chunk of the content from a sourceof the content; calculating a second hash of the chunk received from thesource of the content; determining if the first hash of the portion ofthe chunk matches the second hash of the chunk; and identifying, whenthe first hash of the portion of the chunk is determined to not matchthe second hash of the chunk, a new source for obtaining the chunk. 2.The system of claim 1, wherein the operations further comprisediscarding, when the first hash of the portion of the chunk isdetermined to not match the second hash of the chunk, the chunk receivedfrom the source of the content.
 3. The system of claim 1, wherein theoperations further comprise utilizing the chunk of the content when thefirst hash of the portion of the chunk is determined to match the secondhash of the chunk.
 4. The system of claim 1, wherein the operationsfurther comprise determining, when the first hash of the portion of thechunk is determined to not match the second hash of the chunk, that thechunk received from the source of the content is corrupted.
 5. Thesystem of claim 1, wherein the operations further comprise determiningif the source of the content is a trusted source.
 6. The system of claim5, wherein the operations further comprise utilizing, when the source ofthe content is determined to be the trusted source, the chunk of thecontent received from the source of the content.
 7. The system of claim1, wherein the operations further comprise determining, when the sourceof the content is a peer, that the source of the content is not atrusted source.
 8. The system of claim 1, wherein the operations furthercomprise not calculating the second hash of the chunk when the source ofthe content is a trusted source.
 9. The system of claim 1, wherein theoperations further comprise downloading, when the first hash of theportion of the chunk is determined to not match the second hash of thechunk, the chunk from the new source.
 10. A method, comprising:receiving a playfile associated with content, wherein the playfileincludes a first hash of a portion of a chunk of the content; receivingthe chunk of the content from a source of the content; calculating, byutilizing instructions from memory that are executed by a processor, asecond hash of the chunk received from the source of the content;determining if the first hash of the portion of the chunk matches thesecond hash of the chunk; and identifying, when the first hash of theportion of the chunk is determined to not match the second hash of thechunk, a new source for obtaining the chunk.
 11. The method of claim 10,further comprising discarding, when the first hash of the portion of thechunk is determined to not match the second hash of the chunk, the chunkreceived from the source of the content.
 12. The method of claim 10,further comprising utilizing the chunk of the content when the firsthash of the portion of the chunk is determined to match the second hashof the chunk.
 13. The method of claim 10, further comprisingdetermining, when the first hash of the portion of the chunk isdetermined to not match the second hash of the chunk, that the chunkreceived from the source of the content is corrupted.
 14. The method ofclaim 10, further comprising determining if the source of the content isa trusted source.
 15. The method of claim 14, further comprisingutilizing, when the source of the content is determined to be thetrusted source, the chunk of the content received from the source of thecontent.
 16. The method of claim 10, further comprising determining,when the source of the content is a peer, that the source of the contentis not a trusted source.
 17. The method of claim 10, further comprisingnot calculating the second hash of the chunk when the source of thecontent is a trusted source.
 18. The method of claim 10, furthercomprising downloading, when the first hash of the portion of the chunkis determined to not match the second hash of the chunk, the chunk fromthe new source.
 19. A computer readable device comprising instructions,which, when loaded and executed by a processor, cause the processor toperform operations, the operations comprising: receiving a playfileassociated with content, wherein the playfile includes a first hash of aportion of a chunk of the content; receiving the chunk of the contentfrom a source of the content; calculating a second hash of the chunkreceived from the source of the content; determining if the first hashof the portion of the chunk matches the second hash of the chunk; andidentifying, when the first hash of the portion of the chunk isdetermined to not match the second hash of the chunk, a new source forobtaining the chunk.
 20. The computer-readable device of claim 19,wherein the operations further comprise determining, when the first hashof the portion of the chunk is determined to not match the second hashof the chunk, that the chunk received from the source of the content iscorrupted.